Scaled Torus Principal Component Analysis
نویسندگان
چکیده
A particularly challenging context for dimensionality reduction is multivariate circular data, that is, data supported on a torus. Such kind of appears, example, in the analysis various phenomena environmental sciences and astronomy, as well molecular structures. This article introduces Scaled Torus Principal Component Analysis (ST-PCA), novel approach to perform with toroidal data. ST-PCA finds data-driven map from torus sphere same dimension certain radius. The constructed multidimensional scaling minimize discrepancy between pairwise geodesic distances both spaces. then resorts principal nested spheres obtain sequence subspheres best fits which can afterwards be inverted back Numerical experiments illustrate how used achieve meaningful low-dimensional torii, purpose clusters separation, while two applications astronomy (on three-dimensional torus) biology (seven-dimensional show outperforms existing methods investigated datasets. Supplementary materials this are available online.
منابع مشابه
Torus Principal Component Analysis with an Application to RNA Structures
There are several cutting edge applications needing PCA methods for data on tori and we propose a novel torus-PCA method with important properties that can be generally applied. There are two existing general methods: tangent space PCA and geodesic PCA. However, unlike tangent space PCA, our torus-PCA honors the cyclic topology of the data space whereas, unlike geodesic PCA, our torus-PCA produ...
متن کاملPrincipal Component Projection Without Principal Component Analysis
We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoiding explicit principal component analysis (PCA), our algorithm is the first with no runtime dependen...
متن کاملUnsupervised Learning: Self-aggregation in Scaled Principal Component Space
Abstract We demonstrate that data clustering amounts to a dynamic process of self-aggregation in which data objects move towards each other to form clusters, revealing the inherent pattern of similarity. Self-aggregation is governed by connectivity and occurs in a space obtained by a nonlinear scaling of principal component analysis (PCA). The method combines dimensionality reduction with clust...
متن کاملCompression of Breast Cancer Images By Principal Component Analysis
The principle of dimensionality reduction with PCA is the representation of the dataset ‘X’in terms of eigenvectors ei ∈ RN of its covariance matrix. The eigenvectors oriented in the direction with the maximum variance of X in RN carry the most relevant information of X. These eigenvectors are called principal components [8]. Ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Graphical Statistics
سال: 2022
ISSN: ['1061-8600', '1537-2715']
DOI: https://doi.org/10.1080/10618600.2022.2119985